Undecidability Results for Low Complexity Degree Structures Extended Abstract
نویسنده
چکیده
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one re-ducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in 7]. The method can be applied in fact to all hyper-polynomial time classes.
منابع مشابه
Interpretability and Definability in the Recursively Enumerable Degrees
Coding by ®rst-order formulas in structures arising from computability theory has been a focus of attention for some time. Traditionally, such coding methods are initially used to study the complexity of the theory of the structure. Typically, one ®rst proves that a theory is undecidable by uniformly coding a suf®ciently complex class of structures (with parameters). Then, usually using more so...
متن کاملUndecidability Results for Low Complexity Degree Structures
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in [7]. The method can be applied in fact to all hyper-polynomial time classes.
متن کاملUndecidability Results for Bisimilarity on Prefix Rewrite Systems
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarity for normed pushdown processes. This result was substantially extended by Sénizergues (1998, 2005) who showed the decidability for regular (or equational) graphs of finite out-degree (which include unn...
متن کاملTowards a Theory of Recursive Structures
In computer science, one is interested mainly in nite objects. Insofar as innnite objects are of interest, they must be computable, i.e., recursive, thus admitting an eeective nite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure , model or data base. In this paper we summarize our recent work on recursive structures and data bases, includ...
متن کاملRefining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کامل